Kernel density estimation by stagewise algorithm with a simple dictionary

نویسندگان

چکیده

This study proposes multivariate kernel density estimation by stagewise minimization algorithm based on U-divergence and a simple dictionary. The dictionary consists of an appropriate scalar bandwidth matrix part the original data. resulting estimator brings us data-adaptive weighting parameters matrices, provides sparse representation estimation. We develop non-asymptotic error bound that we obtained via proposed algorithm. It is confirmed from simulation studies performs as well as, or sometimes better than, other well-known estimators.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Simple boundary correction for kernel density estimation

If a probability density function has bounded support, kernel density estimates often overspill the boundaries and are consequently especially biased at and near these edges. In this paper, we consider the alleviation of this boundary problem. A simple unified framework is provided which covers a number of straightforward methods and allows for their comparison: 'generalized jackknifing' genera...

متن کامل

A Sparse Kernel Density Estimation Algorithm Using Forward Constrained Regression

Using the classical Parzen window (PW) estimate as the target function, the sparse kernel density estimator is constructed in a forward constrained regression manner. The leave-one-out (LOO) test score is used for kernel selection. The jackknife parameter estimator subject to positivity constraint check is used for the parameter estimation of a single parameter at each forward step. As such the...

متن کامل

Unimodal Kernel Density Estimation by Data Sharpening

We discuss a robust data sharpening method for rendering a standard kernel estimator, with a given bandwidth, unimodal. It has theoretical and numerical properties of the type that one would like such a technique to enjoy. In particular, we show theoretically that, with probability converging to 1 as sample size diverges, our technique alters the kernel estimator only in places where the latter...

متن کامل

Graph Bundling by Kernel Density Estimation

We present a fast and simple method to compute bundled layouts of general graphs. For this, we first transform a given graph drawing into a density map using kernel density estimation. Next, we apply an image sharpening technique which progressively merges local height maxima by moving the convolved graph edges into the height gradient flow. Our technique can be easily and efficiently implement...

متن کامل

Kernel Density Estimation

Preface The following diploma thesis is thought to be a diploma thesis in applied statistics. I declare this in the first paragraph of my work, because you can treat this subject either from a theoretic or an applied view, although the borders between these two areas of statistics cannot be drawn exactly. The reason why I got the idea to treat this subject, is that on the one hand density estim...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computational Statistics

سال: 2022

ISSN: ['0943-4062', '1613-9658']

DOI: https://doi.org/10.1007/s00180-022-01303-7